Strong Determinism vs . Computability ∗

نویسندگان

  • David Hawkins
  • Cristian Calude
  • Douglas I. Campbell
  • Karl Svozil
  • Doru Ştefănescu
چکیده

Are minds subject to laws of physics? Are the laws of physics computable? Are conscious thought processes computable? Currently there is little agreement as to what are the right answers to these questions. Penrose ([41], p. 644) goes one step further and asserts that: a radical new theory is indeed needed, and I am suggesting, moreover, that this theory, when it is found, will be of an essentially noncomputational character. The aim of this paper is three fold: 1) to examine the incompatibility between the hypothesis of strong determinism and computability, 2) to give new examples of uncomputable physical laws, and 3) to discuss the relevance of Gödel’s Incompleteness Theorem in refuting the claim that an algorithmic theory—like strong AI—can provide an adequate theory of mind. Finally, we question the adequacy of the theory of computation to discuss physical laws and thought processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Reversibility and Determinism in P Systems

Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. Fo...

متن کامل

On the calculating power of Laplace’s demon

We discuss some of the choices that arise when one tries to make the idea of physical determinism more precise. Broadly speaking, ‘ontological’ notions of determinism are parameterized by one’s choice of mathematical ideology, whilst ‘epistemological’ notions of determinism are parameterized by the choice of an appropriate notion of computability. We present some simple examples to show that th...

متن کامل

Aspects of Determinism in Modern Physics

The aims of this chapter are to review some aspects of determinism that are familiar to physicists but are little discussed in the philosophical literature and to show how these aspects connect determinism to issues about symmetries in physics, the structure and ontological status of spacetime, predictability, and computability. It will emerge that in some respects determinism is a robust doctr...

متن کامل

On the calculating power of Laplace’s demon (Part I)

We discuss several ways of making precise the informal concept of physical determinism, drawing on ideas from mathematical logic and computability theory. We outline a programme of investigating these notions of determinism in detail for specific, precisely articulated physical theories. We make a start on our programme by proposing a general logical framework for describing physical theories, ...

متن کامل

The physical Church thesis and the sensitivity to initial conditions

The physical Church thesis is a thesis about nature that expresses that all that can be computed by a physical system— a machine — is computable in the sense of computability theory. At a first look, this thesis seems contradictory with the existence, in nature, of chaotic dynamical systems, that is systems whose evolution cannot be “computed” because of their sensitivity to initial conditions....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995